/*
 * @Author: lei
 * @Description: 二分查找
 * @FilePath: /C++_world/serach/binary_find.h
 */
#include <vector>
// 二分搜索条件：需要v是一个有序序列
int BinaryFindAny1(std::vector<int>& v, int target);
int BinaryFindAny2(std::vector<int>& v, int target);
int BinaryFindLeft1(std::vector<int>& v, int target);
int BinaryFindLeft2(std::vector<int>& v, int target);
int BinaryFindRight1(std::vector<int>& v, int target);
int BinaryFindRight2(std::vector<int>& v, int target);